Optimal gossiping in paths and cycles
نویسندگان
چکیده
In the gossiping problem each node in a network possesses a token initially after gossiping every node has a copy of every other node s token The nodes exchange their tokens by packets A solution to the problem is judged by how many rounds of packet sending it requires In this paper we consider the version of the problem in which a packet is of limited size a packet can hold up to p tokens the links edges of the network are half duplex only one packet can ow through a link at a time and the nodes are all port a node s incident edges can all be active at the same time This is also known as the H model We study the path and the cycle which are essential building blocks for more complex structures We present tight lower bounds and matching algorithms The results also lead to the conclusion that p is the optimal packet size
منابع مشابه
Note on Optimal Gossiping in Some Weak-Connected Graphs
The problems of gossiping and broadcasting in one-way communication mode are investigated. Optimal algorithms for gossip problem are known only for the complete graphs, paths, some simple trees, and cycles. In this paper some lower bounds on gossiping in graphs with bridges or with edge disjoint cycles are proved. A direct consequence of these lower bounds are optimal gossip algorithms for some...
متن کاملCharacterization of signed paths and cycles admitting minus dominating function
If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.
متن کاملFast Gossiping by Short Messages
Gossiping is the process of information diiusion in which each node of a network holds a packet that must be communicated to all other nodes in the network. We consider the problem of gossiping in communication networks under the restriction that communicating nodes can exchange up to a xed number p of packets at each round. In the rst part of the paper we study the extremal case p = 1 and we e...
متن کاملGossiping with Multiple Sends and Receives
We consider the problem of gossiping in several important networks in as few rounds as possible. During a single round, each processor may send an unlimited size message to k neighbors, or receive messages from k neighbors, but a processor cannot both send and receive during the same round. The network architectures we consider are trees, cycles, grids, hypercubes, and toroidal (or " wrap-aroun...
متن کاملOptimal Algorithms for Disemination of Information in Generalized Communication Modes
Some generalized communication modes enabling the dissemination of information among processors of interconnection networks via vertex-disjoint or edge-disjoint paths in one communication step will be investigated. A thorough study of these communication modes will be presented by giving optimal algorithms for broadcasting, accumulation and gossiping in most of the well known parallel architect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Discrete Algorithms
دوره 1 شماره
صفحات -
تاریخ انتشار 2003